Finite Computable Dimension and Degrees of Categoricity
نویسندگان
چکیده
We first give an example of a rigid structure of computable dimension 2 such that the unique isomorphism between two non-computably isomorphic computable copies has Turing degree strictly below 0′′, and not above 0′. This gives a first example of a computable structure with a degree of categoricity that does not belong to an interval of the form [0(α),0(α+ 1)] for any computable ordinal α. We then extend the technique to produce a rigid structure of computable dimension 3 such that if d0, d1, and d2 are the degrees of isomorphisms between distinct representatives of the three computable equivalence classes, then each di < d0 ⊕ d1 ⊕ d2. The resulting structure is an example of a structure that has a degree of categoricity, but not strongly.
منابع مشابه
Categoricity Properties for Computable Algebraic Fields
We examine categoricity issues for computable algebraic fields. Such fields behave nicely for computable dimension: we show that they cannot have finite computable dimension greater than 1. However, they behave less nicely with regard to relative computable categoricity: we give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is ...
متن کاملThe computable dimension of trees of infinite height
In a finite language, a model A is computable if its domain is a computable subset of ω, and its basic operations and relations are all computable. In computable model theory, algorithmic properties of algebraic systems are treated up to computable isomorphism. The number of distinct (up to computable isomorphism) computable presentations of a model A is called the computable dimension of A. If...
متن کاملCategoricity Spectra for Rigid Structures
For a computable structure M , the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M . If the spectrum has a least degree, this degree is called the degree of categoricity of M . In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures wi...
متن کاملDegrees of Categoricity and the Hyperarithmetic Hierarchy
We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of Fokina, Kalimullin, and R. Miller to show that for every computable ordinal α, 0 is the degree of categoricity of some computable structure A. We show additionally that for α a computable successor ordinal, every degree 2-c.e. in and above 0 is a degree of categoricity. We further prove that every degree of c...
متن کاملDegrees of categoricity of computable structures
Defining the degree of categoricity of a computable structureM to be the least degree d for whichM is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that for all n, degrees d.c.e. in and above 0 can be so realized, as can the degree 0.
متن کامل